#include <vector> // review 153 O(log n) O(1)
using namespace std;
class Solution {
public:
int findMin(vector<int>& a) {
int l = 0, r = (int)a.size() - 1;
while (l < r) {
int m = l + ((r - l) >> 1);
if (a[r] >= a[m]) r = m;
else l = m + 1;
}
return a[l];
}
};
靜下心背誦的可貴
iThome鐵人賽
看影片追技術